On computing graph closures
نویسندگان
چکیده
منابع مشابه
Graph Decomposition and Recursive Closures
Abstract. In this paper, we propose a new algorithm for computing recursive closures. The main idea behind this is tree labeling and graph decomposition, based on which the transitive closure of a directed graph can be computed in O(e⋅b) time and O(n⋅b) space, where n is the number of the nodes of the graph, e is the numbers of the edges, and b is the graph’s breadth. It is a better computation...
متن کاملComputing GA4 Index of Some Graph Operations
The geometric-arithmetic index is another topological index was defined as 2 deg ( )deg ( ) ( ) deg ( ) deg ( ) G G uv E G G u v GA G u v , in which degree of vertex u denoted by degG (u). We now define a new version of GA index as 4 ( ) 2 ε ( )ε ( ) ( ) ε ( ) ε ( ) G G e uv E G G G u v GA G u v , where εG(u) is the eccentricity of vertex u. In this paper we compute this new t...
متن کاملGraph Closures and Metric Compactifications of Tv
It is shown that all compactifications of the positive integers N which have metrizable remainders are themselves metrizable. This is done by first proving that each Hausdorff compactification of a noncompact locally compact space is the graph closure in an appropriate space. It is then shown that any two compactifications of N which have homeomorphic metrizable remainders are homeomorphic.
متن کاملComputing Downward Closures for Stacked Counter Automata
The downward closure of a language L of words is the set of all (not necessarily contiguous) subwords of members of L. It is well known that the downward closure of any language is regular. Although the downward closure seems to be a promising abstraction, there are only few language classes for which an automaton for the downward closure is known to be computable. It is shown here that for sta...
متن کاملAn Approach to Computing Downward Closures
The downward closure of a word language is the set of all (not necessarily contiguous) subwords of its members. It is well-known that the downward closure of any language is regular. While the downward closure appears to be a powerful abstraction, algorithms for computing a finite automaton for the downward closure of a given language have been established only for few language classes. This wo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 1989
ISSN: 0020-0190
DOI: 10.1016/0020-0190(89)90082-3